ZWEI VERFAHREN ZUR SUCHE NEGATIVER ZYKLEN IN BEWERTETEN DIGRAPHEN = DEUX ALGORITHMES POUR DETECTER LES CYCLES NEGATIFS DANS UN GRAPHE ORIENTE VALUEDOMSCHKE W.1973; COMPUTING; AUSTR.; DA. 1973; VOL. 11; NO 2; PP. 125-136; ABS. ANGL.; BIBL. 14 REF.Serial Issue

ALGOL-PROZEDUREN FUER ZWEI VERFAHREN ZUR SUCHE NEGATIVER ZYKLEN IN BEWERTETEN DIGRAPHEN = PROCEDURES ALGOL POUR DEUX METHODES DE DETECTION DE CYCLES NEGATIFS DANS DES GRAPHES ORIENTES VALUESDOMSCHKE W.1973; COMPUTING; AUSTR.; DA. 1973; VOL. 11; NO 2; PP. 169-173; ABS. ANGL.; BIBL. 1 REF.Serial Issue

THEORIE DES GRAPHESTHEILER G.1977; REV. STATIST.; ROMAN.; DA. 1977; VOL. 26; NO 9; PP. 20-29Article

A CLASS OF CONTINUOUS NETWORK FLOW PROBLEMSANDERSON EJ; NASH P; PHILIPOTT AB et al.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 4; PP. 501-514; BIBL. 6 REF.Article

DETERMINATION OF SHORTEST PATH IN A NETWORK WITH TIME-DEPENDENT EDGE-LENGTHSKLAFSZKY E.1972; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1972; VOL. 3; NO 4; PP. 255-257; ABS. ALLEM. FR.; BIBL. 5 REF.Serial Issue

UN ALGORITHME POUR LE PROBLEME D'AFFECTATIONTABOURIER Y.1972; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., V; FR.; DA. 1972; VOL. 6; PP. 3-15; BIBL. 8 REF.Serial Issue

THE FORD-JOHNSON SORTING ALGORITHM IS NOT OPTIMALMANACHER GK.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 3; PP. 441-456; BIBL. 11 REF.Article

MULTIPROCESSOR SCHEDULING WITH THE AID OF NETWORK FLOW ALGORITHMS.STONE HS.1977; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1977; VOL. 3; NO 1; PP. 85-93; BIBL. 19 REF.Article

L'ALGORITHME HONGROIS ET SON APPLICATION A L'AFFECTATION DU PERSONNEL AUXILIAIRE AU RECTORATLIEGEY D.1973; AO-CNRS-6361; FR.; DA. 1973; PP. (139 P.); BIBL. 1 P.; (THESE DOCT. ING.; UNIV. NANCY I)Thesis

MAN-COMPUTER DYNAMIC SCHEDULING SYSTEMSWILKINSON WL.1972; IN: NATO CONF. APPL. OPER. RES. TRANSP. PROBL. SANDEJFORD, NORWAY, 1972. PROC.; S.L.; DA. 1972; PP. 249-257; BIBL. 3 REF.Conference Paper

A measure-theoretical max-flow-min-cut problemBLUM, W.Mathematische Zeitschrift. 1990, Vol 205, Num 3, pp 451-470, issn 0025-5874, 20 p.Article

New results in minimum-comparison SortingPECZARSKI, Marcin.Algorithmica. 2004, Vol 40, Num 2, pp 133-145, issn 0178-4617, 13 p.Article

Optimum combinations of sorting and mergingMANACHER, G. K; BUI, T. D; MAI, T et al.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 2, pp 290-334, issn 0004-5411Article

Exact maximum a posteriori estimation for binary imagesGREIG, D. M; PORTEOUS, B. T; SEHEULT, A. H et al.Journal of the Royal Statistical Society. Series B. Methodological. 1989, Vol 51, Num 2, pp 271-279, issn 0035-9246Article

An innovative technique for backbone network designCHATTOPADHYAY, N. G; MORGAN, T. W; ASWATNARAYAN RAGHURAM et al.IEEE transactions on systems, man, and cybernetics. 1989, Vol 19, Num 5, pp 1122-1132, issn 0018-9472, 11 p.Article

Orthogonal structures in directed graphsFELSNER, S.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 2, pp 309-321, issn 0095-8956Article